A sequential learning algorithm for online constructing belief-rule-based systems

نویسندگان

  • Zhi-Jie Zhou
  • Chang-Hua Hu
  • Jian-Bo Yang
  • Dong-Ling Xu
  • Mao-Yin Chen
  • Donghua Zhou
چکیده

A belief rule base inference methodology using the evidential reasoning (RIMER) approach has been developed recently. A belief rule base (BRB), which can be treated as a more generalized expert system, extends traditional IF-THEN rules, but requires the assignment of some system parameters including rule weights, attribute weights, and belief degrees. These parameters need to be determined with care for reliable system simulation and prediction. Some off-line optimization models have been proposed, but it is expensive to train and re-train these models in particular for large-scale systems. Moreover, the recursive algorithms are also proposed to fine tune a BRB online, which require less calculation time and satisfy the real-time requirement. However, the earlier mentioned learning algorithms are all based on a predetermined structure of the BRB. For a complex system, prior knowledge may not be perfect, which leads to the construction of an incomplete or even inappropriate initial BRB structure. Also, too many rules in an initial BRB may lead to over fitting, whilst too few rules may result in under fitting. Consequently, such a BRB system may not be capable of achieving overall optimal performance. In this paper, we consider one realistic and important case where both a preliminary BRB structure and system parameters assigned to given rules can be adjusted online. Based on the definition of a new statistical utility for a belief rule as investigated in this paper, a sequential learning algorithm for online constructing more compact BRB systems is proposed. Compared with the other learning algorithms, a belief rule can be automatically added into the BRB or pruned from the BRB, and our algorithm can also satisfy the real-time requirement. In addition, our algorithm inherits the feature of RIMER, i.e., only partial input and output information is required, which could be either incomplete or vague, either numerical or judgmental, or mixed. In order to verify the effectiveness of the proposed algorithm, a practical case study about oil pipeline leak detection is studied and examined to demonstrate how the algorithm can be implemented. 2009 Elsevier Ltd. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Online Fault Detection and Isolation Method Based on Belief Rule Base for Industrial Gas Turbines

Real time and accurate fault detection has attracted an increasing attention with a growing demand for higher operational efficiency and safety of industrial gas turbines as complex engineering systems. Current methods based on condition monitoring data have drawbacks in using both expert knowledge and quantitative information for detecting faults. On account of this reason, this paper proposes...

متن کامل

A Random Forest Classifier based on Genetic Algorithm for Cardiovascular Diseases Diagnosis (RESEARCH NOTE)

Machine learning-based classification techniques provide support for the decision making process in the field of healthcare, especially in disease diagnosis, prognosis and screening. Healthcare datasets are voluminous in nature and their high dimensionality problem comprises in terms of slower learning rate and higher computational cost. Feature selection is expected to deal with the high dimen...

متن کامل

Sequential and Mixed Genetic Algorithm and Learning Automata (SGALA, MGALA) for Feature Selection in QSAR

Feature selection is of great importance in Quantitative Structure-Activity Relationship (QSAR) analysis. This problem has been solved using some meta-heuristic algorithms such as: GA, PSO, ACO, SA and so on. In this work two novel hybrid meta-heuristic algorithms i.e. Sequential GA and LA (SGALA) and Mixed GA and LA (MGALA), which are based on Genetic algorithm and learning automata for QSAR f...

متن کامل

A Higher Order Online Lyapunov-Based Emotional Learning for Rough-Neural Identifiers

o enhance the performances of rough-neural networks (R-NNs) in the system identification‎, ‎on the base of emotional learning‎, ‎a new stable learning algorithm is developed for them‎. ‎This algorithm facilitates the error convergence by increasing the memory depth of R-NNs‎. ‎To this end‎, ‎an emotional signal as a linear combination of identification error and its differences is used to achie...

متن کامل

Sequential and Mixed Genetic Algorithm and Learning Automata (SGALA, MGALA) for Feature Selection in QSAR

Feature selection is of great importance in Quantitative Structure-Activity Relationship (QSAR) analysis. This problem has been solved using some meta-heuristic algorithms such as: GA, PSO, ACO, SA and so on. In this work two novel hybrid meta-heuristic algorithms i.e. Sequential GA and LA (SGALA) and Mixed GA and LA (MGALA), which are based on Genetic algorithm and learning automata for QSAR f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Expert Syst. Appl.

دوره 37  شماره 

صفحات  -

تاریخ انتشار 2010